Tree-Structured Data Processing Platform for Large-Scale Data Mining

A Big Data Platform for Large Scale Event Processing

a reducer function that processes intermediate values associated with the same intermediate key. For the example of simply counting the number of terms occurring across the entire collection of documents, the mapper takes as input a document URL (key) and the document content (value) and outputs pairs of term and term count in the document. The reducer then aggregates all term counts of a term ...

A Big Data Platform for Large Scale Event Processing

a reducer function that processes intermediate values associated with the same intermediate key. For the example of simply counting the number of terms occurring across the entire collection of documents, the mapper takes as input a document URL (key) and the document content (value) and outputs pairs of term and term count in the document. The reducer then aggregates all term counts of a term ...

Mining Tree-Structured Data on Multicore Systems

Mining frequent subtrees in a database of rooted and labeled trees is an important problem in many domains, ranging from phylogenetic analysis to biochemistry and from linguistic parsing to XML data analysis. In this work we revisit this problem and develop an architecture conscious solution targeting emerging multicore systems. Specifically we identify a sequence of memory related optimization...

Mining Structured Data Mining Structured Data

Mining Large-Scale Retail Data

Understanding customer buying patterns is of great interest in the retail industry. Applications include targeted advertising, optimized product placement, and cross-promotions. Association rules, expressed as A → B (if A then B) are a common and easily understandable ways to represent buying patterns. While the problem of mining such rules has received considerable attention over the past year...